The Avoidability of Cubes under Permutations
نویسندگان
چکیده
In this paper we consider the avoidance of patterns in infinite words. Generalising the traditional problem setting, functional dependencies between pattern variables are allowed here, in particular, patterns involving permutations. One of the remarkable facts is that in this setting the notion of avoidability index (the smallest alphabet size for which a pattern is avoidable) is meaningless since a pattern with permutations that is avoidable in one alphabet can be unavoidable in a larger alphabet. We characterise the (un-)avoidability of all patterns of the form π(x)π(x)π(x), called cubes under permutations here, for all alphabet sizes in both the morphic and antimorphic case.
منابع مشابه
Avoidability of long k-abelian repetitions
We study the avoidability of long k-abelian-squares and k-abeliancubes on binary and ternary alphabets. For k = 1, these are Mäkelä’s questions. We show that one cannot avoid abelian-cubes of abelian period at least 2 in infinite binary words, and therefore answering negatively one question from Mäkelä. Then we show that one can avoid 3-abelian-squares of period at least 3 in infinite binary wo...
متن کاملCongestion-free routing of linear permutations on Fibonacci and Lucas cubes
In recent years there has been much interest in certain subcubes of hypercubes, namely Fibonacci cubes and Lucas cubes (and their generalized versions). In this article we consider off-line routing of linear permutations on these cubes. The model of routing we use regards edges as bi-directional, and we do not allow queues of length greater than one. Messages start out at different vertices, an...
متن کاملLatin Cubes and Hypercubes of Prime Order
In [3]s the first author obtained an expression for the number of equivalence classes induced on the set of ft x ft Latin squares under row and column permutations. The first purpose of this paper is to point out that the results of [3] do not hold for all n, but rather that they hold only if n is a prime.* The second purpose of this paper is, in the case of prime ft, to extend the results of [...
متن کاملCubes of Conjugacy Classes Covering the Infinite Symmetric Group
Using combinatorial methods, we prove the following theorem on the group S of all permutations of a countably-infmite set: Whenever p 6 S has infinite support without being a fixed-point-free involution, then any s G S is a product of three conjugates of p. Furthermore, we present uncountably many new conjugacy classes C of S satisfying that any s G S is a product of two elements of C. Similar ...
متن کاملContributions to a computational theory of policy advice and avoidability
We present the starting elements of a mathematical theory of policy advice and avoidability. More specifically, we formalize a cluster of notions related to policy advice, such as policy, viability, reachability, and propose a novel approach for assisting decision making, based on the concept of avoidability. We formalize avoidability as a relation between current and future states, investigate...
متن کامل